Covering a set of points by two axis-parallel boxes
نویسندگان
چکیده
In this paper we consider the following covering problem. Given a set S of n points in d-dimensional space, d 2, nd two axis-parallel boxes that together cover the set S such that the measure of the largest box is minimized, where the measure is a monotone function of the box. We present a simple algorithm for nding boxes in O(n log n + n d?1) time and O(n) space.
منابع مشابه
Piercing Axis-parallel Boxes
Given a finite family F of axis-parallel boxes in R such that F contains no k + 1 pairwise disjoint boxes, and such that for each two intersecting boxes in F a corner of one box is contained in the other box, we prove that F can be pierced by at most ck log log(k) points, where c is a constant depending only on d. We further show that in some special cases the upper bound on the number of pierc...
متن کاملCovering points by disjoint boxes with outliers
For a set of n points in the plane, we consider the axis–aligned (p, k)-Box Covering problem: Find p axis-aligned, pairwise-disjoint boxes that together contain at least n − k points. In this paper, we consider the boxes to be either squares or rectangles, and we want to minimize the area of the largest box. For general p we show that the problem is NP-hard for both squares and rectangles. For ...
متن کاملCovering many points with a small-area box
Let P be a set of n points in the plane. We show how to find, for a given integer k > 0, the smallest-area axis-parallel rectangle that covers k points of P in O(nk log n+ n log n) time. We also consider the problem of, given a value α > 0, covering as many points of P as possible with an axis-parallel rectangle of area at most α. For this problem we give a randomized (1−ε)-approximation that w...
متن کاملThe class cover problem with boxes
In this paper we study the following problem: Given sets R and B of r red and b blue points respectively in the plane, find a minimum-cardinality set H of axis-aligned rectangles (boxes) so that every point in B is covered by at least one rectangle of H, and no rectangle of H contains a point of R. We prove the NP-hardness of the stated problem, and give either exact or approximate algorithms d...
متن کاملClassifying negative and positive points by optimal box clustering
In this paper we address the problem of classifying positive and negative data with the technique known as box clustering. A box is homogeneous if it contains only positive (negative) points. Box clustering means finding a family of homogeneous boxes jointly containing all and only positive (negative) points. We first consider the problem of finding a family with the minimum number of boxes. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 75 شماره
صفحات -
تاریخ انتشار 1997